- sequence of edges
- ciąg krawędzi grafu
English-Polish dictionary of Electronics and Computer Science. 2013.
sequence of edges
Look at other dictionaries:
Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length … Wikipedia
De Bruijn sequence — A diagram showing the De Bruijn sequence where k=2 and n=2 In combinatorial mathematics, a k ary De Bruijn sequence B(k, n) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A … Wikipedia
Cratonic sequence — A cratonic sequence refers to a very large scale lithostratographic sequence that covers a complete marine transgressive regressive cycle across a craton. They are also known as megasequences , stratigraphic sequences , sloss sequence or simply… … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Glossary of figure skating terms — The following is a list of figure skating terms, sorted alphabetically. Contents: Top 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z … Wikipedia
Subshift of finite type — In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Five color theorem — The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent… … Wikipedia
Dowling geometry — In combinatorial mathematics, a Dowling geometry, named after Thomas A. Dowling, is a matroid associated with a group. There is a Dowling geometry of each rank for each group. If the rank is at least 3, the Dowling geometry uniquely determines… … Wikipedia
Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the … Wikipedia
Johnson's algorithm — is a way to find shortest paths between all pairs of vertices in a sparse directed graph. It allows some of the edge weights to be negative numbers, but no negative weight cycles may exist.Algorithm descriptionJohnson s algorithm consists of the… … Wikipedia
